WAVEGUIDE: Evaluating SPARQL Property Path Queries
نویسندگان
چکیده
The extension of SPARQL 1.1 of property paths now o↵ers a type of regular path query for RDF graph databases. While eminently useful, these queries are di cult to optimize to evaluate e ciently. We have embarked on a project we call Waveguide to build a cost-based optimizer for SPARQL queries with property paths. Waveguidemaps the property path to a waveguide plan (WGP) composed of wavefront automata (WFAs) modeled by (non-deterministic) finite automata. The waveguide plan guides the graph search during evaluation. Our Waveguide prototype illustrates the types of optimizations this approach a↵ords and the performance gains that can be obtained.
منابع مشابه
Evaluating SPARQL 1.1 Property Path Support
With the release of SPARQL 1.1 in 2013 property paths were introduced, which make it possible to describe queries that do not explicitly define the length of the path that is traversed within an RDF graph. Already existing RDF stores were adapted to support property paths. In order to give an insight on how well the current implementations of property paths in RDF stores work, we introduce a be...
متن کاملTowards Query Optimization for SPARQL Property Paths
The extension of SPARQL in version 1.1 with property paths offers a type of regular path query for RDF graph databases. Such queries are difficult to optimize and evaluate efficiently, however. We have embarked on a project, Waveguide, to build a cost-based optimizer for SPARQL queries with property paths. Waveguide builds a query plan—a waveguide plan (WGP)—which guides the query evaluation. T...
متن کاملPath discovery by Querying the federation of Relational Database and RDF Graph
The class of queries for detecting path is an important as those can extract implicit binary relations over the nodes of input graphs. Most of the path querying languages used by the RDF community, like property paths in W3C SPARQL 1.1 and nested regular expressions in nSPARQL are based on the regular expressions. Federated queries allow for combining graph patterns and relational database that...
متن کاملTop-K Shortest Paths in Large Typed RDF Datasets Challenge
Perhaps the most widely appreciated linked data principle is the one that instructs linked data providers to provide useful information using the standards (i.e., RDF and SPARQL). Such information corresponds to patterns expressed as SPARQL queries that are matched against the RDF graph. Until recently, it was not possible to create a pattern without specifying the exact path that would match a...
متن کاملKilling Two Birds with One Stone - Querying Property Graphs using SPARQL via GREMLINATOR
Knowledge graphs have become popular over the past decade and frequently rely on the Resource Description Framework (RDF) or Property Graph (PG) databases as data models. However, the query languages for these two data models – SPARQL for RDF and the PG traversal language Gremlin – are lacking interoperability. We present Gremlinator, the rst translator from SPARQL – the W3C standardised langua...
متن کامل